The signed and minus k-subdomination numbers of comets

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minus edge k-subdomination numbers in graphs

The closed neighborhood NG[e] of an edge e in a graph G is the set consisting of e and of all edges having a common end-vertex with e. Let f be a function on E(G), the edge set of G, into the set {−1, 0, 1}. If ∑ x∈N [e] f(x) ≥ 1 for at least k edges e of G, then f is called a minus edge k-subdominating function of G. The minimum of the values ∑ e∈E(G) f(e), taken over all minus edge k-subdomin...

متن کامل

Signed edge k-subdomination numbers in graphs

The closed neighborhood NG[e] of an edge e in a graph G is the set consisting of e and of all edges having a common end-vertex with e. Let f be a function on E(G), the edge set of G, into the set {−1, 1}. If ∑ x∈N [e] f(x) ≥ 1 for at least k edges e of G, then f is called a signed edge k-subdominating function of G. The minimum of the values ∑ e∈E(G) f(e), taken over all signed edge k-subdomina...

متن کامل

Signed star k-subdomination numbers in graphs

Let G be a simple graph without isolated vertex with vertex set V (G) and edge set E(G). A function f : E(G) −→ {−1, 1} is said to be a signed star k-subdominating function of G if ∑ e∈E(v) f (e) ≥ 1 for at least k vertices v of G, where E(v) = {uv ∈ E(G) | u ∈ N (v)}. The value min ∑ e∈E(G) f (e), taking over all signed star k-subdominating function f of G is called the signed star k-subdomina...

متن کامل

The minus k-domination numbers in graphs

For any integer  ‎, ‎a minus  k-dominating function is a‎function  f‎ : ‎V (G)  {-1,0‎, ‎1} satisfying w) for every  vertex v, ‎where N(v) ={u V(G) | uv  E(G)}  and N[v] =N(v)cup {v}. ‎The minimum of ‎the values of  v)‎, ‎taken over all minus‎k-dominating functions f,‎ is called the minus k-domination‎number and is denoted by $gamma_k^-(G)$ ‎. ‎In this paper‎, ‎we ‎introduce the study of minu...

متن کامل

Minus k-subdomination in graphs III

Let G = (V, E) be a graph. For any real valued function 1 : V --+ R and S ~ V, let 1 (S) = L:UES 1 ( u). The weight of 1 is defined as I(V). We will also denote I(N[v]) by I[v]' where v E V. A minus k-subdominating function (k8F) for G is defined in [1] as a function 1 : V --+ {-I, 0, I} such that I[v] 2:: 1 for at least k vertices of G. The minus k-subdomination number of a graph G, denoted by...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1998

ISSN: 0012-365X

DOI: 10.1016/s0012-365x(97)00051-4